منابع مشابه
Decomposition attack on SASASASAS
We demonstrate the first attacks on the SPN ciphers with 6, 7, 8, and 9 secret layers. In particular, we show a decomposition attack on the SASASASAS scheme when the S-box size m and the block length n satisfy the condition m ≤ n (for example, 8-bit S-box and 128-bit block).
متن کاملLinear Attack Using Multiple Linear Approximations
One of Kaliski and Robshaw’s algorithms, which is used for the linear attack on block ciphers with multiple linear approximations and introduced as Algorithm 2M in this paper, looks efficient but lacks any theoretical and mathematical description. It means there exists no way to estimate the data complexity required for the attack by the algorithm except experiments of the reduced variants. In ...
متن کاملLinear decomposition attack on public key exchange protocols using semidirect products of (semi)groups
We show that a linear decomposition attack based on the decomposition method introduced by the author in monography [1] and paper [2] works by finding the exchanging keys in the both two main protocols in [3] and [4].
متن کاملOn the complexity of Decomposition Attack
In recent researches, it is discovered that index calculus is useful for solving the discrete logarithm problems (DLP) of the groups of the Jacobian of curves (including elliptic curve) over finite field, which are widely used to cryptosystems. In these cases, the probability that an element of the group is written by the summation of N elements of large primes and factor bases is O(1) where N ...
متن کاملLinear Distinguishing Attack on NLS
We present a distinguishing attack on NLS which is one of the stream ciphers submitted to the eSTREAM project. We build the distinguisher by using linear approximations of both the non-linear feedback shift register (NFSR) and the nonlinear filter function (NLF). Since the bias of the distinguisher depends on the Konst value, which is a key-dependent word, we estimate the average bias to be aro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Groups Complexity Cryptology
سال: 2015
ISSN: 1867-1144,1869-6104
DOI: 10.1515/gcc-2015-0007